Topological quantum compiling

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Topological quantum compiling

A method for compiling quantum algorithms into specific braiding patterns for non-Abelian quasiparticles described by the so-called Fibonacci anyon model is developed. The method is based on the observation that a universal set of quantum gates acting on qubits encoded using triplets of these quasiparticles can be built entirely out of three-stranded braids three-braids . These three-braids can...

متن کامل

Asymptotically Optimal Topological Quantum Compiling

We address the problem of compiling quantum operations into braid representations for non-Abelian quasiparticles described by the Fibonacci anyon model. We classify the single-qubit unitaries that can be represented exactly by Fibonacci anyon braids and use the classification to develop a probabilistically polynomial algorithm that approximates any given single-qubit unitary to a desired precis...

متن کامل

New methods for Quantum Compiling

The efficiency of compiling high-level quantum algorithms into instruction sets native to quantum computers defines the moment in the future when we will be able to solve interesting and important problems on quantum computers. In my work I focus on the new methods for compiling single qubit operations that appear in many quantum algorithms into single qubit operations natively supported by sev...

متن کامل

Topological analysis and Quantum mechanical structure of Ozone

Topological analysis has been performed on the total electron density of the two forms of Ozonemolecule,C2V and D3H ,to investigate the nature of chemical bonds ,molecular structure , atomiccharges and electrical properties. While these concepts have been completely discussed usingclassical models the emphasize in this work is based on Quantum Theory of Atoms in Molecules(QTAIM). Because the D3...

متن کامل

Compiling Quantum Circuits using the Palindrome Transform

The design and optimization of quantum circuits is central to quantum computation. This paper presents new algorithms for compiling arbitrary 2 ×2 unitary matrices into efficient circuits of (n−1)controlled single-qubit and (n−1)-controlled-NOT gates. We first present a general algebraic optimization technique, which we call the Palindrome Transform, that can be used to minimize the number of s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review B

سال: 2007

ISSN: 1098-0121,1550-235X

DOI: 10.1103/physrevb.75.165310